Model Checking: Historical Perspective
نویسنده
چکیده
Model checking is an automatic verification technique for finite state concurrent systems such as sequential circuit designs and communication protocols. Specifications are expressed in propositional temporal logic. An exhaustive search of the global state transition graph or system model is used to determine if the specification is true or not. If the specification is not satisfied, a counterexample execution trace is generated if possible. By encoding the model using Binary Decision Diagrams (BDDs) it is possible to search extremely large state spaces with as many as 10 reachable states. In this paper we describe the theory underlying this technique and outline its historical development. We demonstrate the power of model checking to find subtle errors by verifying the Space Shuttle Three-Engines-Out Contingency Guidance Protocol.
منابع مشابه
Hardware Model Checking Competition 2014: An Analysis and Comparison of Model Checkers and Benchmarks
Model checkers and sequential equivalence checkers have become essential tools for the semiconductor industry in recent years. The Hardware Model Checking Competition (HWMCC) was founded in 2006 with the purpose of intensifying research interest in these technologies, and establishing more of a science behind them. For example, the competition provided a standardized benchmark format, a challen...
متن کاملModel Checking and UTP Design Veri cation
We give a di erent perspective on veri cation of programs. Our perspective emphasizes the use of design veri cation in the uni ed theory of programming. The main idea is that of applying model checking to the veri cation of programs expressed in the pre and postcondition style of the uni ed theory of programming, leading to a closer relationship between program development and program veri cati...
متن کاملModel Checking: A Complexity-Theoretic Perspective (invited talk)
In model checking one uses algorithmic techniques to establish thecorrectness of the design with respect to a given property. Model checking is based on a small number of key algorithmic ideas, tying together graph theory, automata theory, and logic. In the last few years, this area has seen a dramatic expansion of activities. Today many companies cannot wait to get the most advanced tools avai...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کامل